Seating rearrangements on arbitrary graphs

Seating Rearrangements on Arbitrary Graphs

In this paper, we exhibit a combinatorial model based on seating rearrangements, motivated by some problems proposed in the 1990’s by Kennedy, Cooper, and Honsberger. We provide a simpler interpretation of their results on rectangular grids, and then generalize the model to arbitrary graphs. This generalization allows us to pose a variety of well–motivated counting problems on other frequently ...

Pair-factorized steady states on arbitrary graphs

Stochastic mass transport models are usually described by specifying hopping rates of particles between sites of a given lattice, and the goal is to predict the existence and properties of the steady state. Here we ask the reverse question: given a stationary state that factorizes over links (pairs of sites) of an arbitrary connected graph, what are possible hopping rates that converge to this ...

Vertex-Reinforced Random Walk on Arbitrary Graphs

DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...

The Impact of Seating Location and Seating Type on

While an extensive body of research exists regarding the delivery of course knowledge and material, much less attention has been paid to the performance effect of seating position within a classroom. Research findings are mixed as to whether students in the front row of a classroom outperform students in the back row. Another issue that has not been fully examined in higher education is the eff...